Globally convergent algorithms for nding zeros of duplomonotone mappings

نویسندگان

  • Francisco J. Aragón Artacho
  • Ronan M.T. Fleming
چکیده

We introduce a new class of mappings, called duplomonotone, which is strictly broader than the class of monotone mappings. We study some of the main properties of duplomonotone functions and provide various examples, including nonlinear duplomonotone functions arising from the study of systems of biochemical reactions. Finally, we present three variations of a derivative-free line search algorithm for nding zeros of systems of duplomonotone equations, and we prove their linear convergence to a zero of the function.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Globally convergent algorithms for finding zeros of duplomonotone mappings

We introduce a new class of mappings, called duplomonotone, which is strictly broader than the class ofmonotonemappings.We study some of themain properties of duplomonotone functions and provide various examples, including nonlinear duplomonotone functions arising from the study of systems of biochemical reactions. Finally,we present three variations of a derivative-free line search algorithm f...

متن کامل

On the strong convergence theorems by the hybrid method for a family of mappings in uniformly convex Banach spaces

Some algorithms for nding common xed point of a family of mappings isconstructed. Indeed, let C be a nonempty closed convex subset of a uniformlyconvex Banach space X whose norm is Gateaux dierentiable and let {Tn} bea family of self-mappings on C such that the set of all common fixed pointsof {Tn} is nonempty. We construct a sequence {xn} generated by the hybridmethod and also we give the cond...

متن کامل

Computation of Equilibria in Finite Games

We review the current state of the art of methods for numerical computation of Nash equilibria for nite n-person games. Classical path following methods, such as the Lemke-Howson algorithm for two person games, and Scarf-type xed point algorithms for n-person games provide globally convergent methods for nding a sample equilibrium. For large problems, methods which are not globally convergent, ...

متن کامل

Viscosity approximation methods for W-mappings in Hilbert space

We suggest a explicit viscosity iterative algorithm for nding a common elementof the set of common xed points for W-mappings which solves somevariational inequality. Also, we prove a strong convergence theorem with somecontrol conditions. Finally, we apply our results to solve the equilibrium problems.Finally, examples and numerical results are also given.

متن کامل

Experiments with Conjugate Gradient Algorithms for Homotopy Curve Tracking

There are algorithms for finding zeros or fixed points of nonlinear systems of equations that are globally convergent for almost all starting points, i.e., with probability one. The essence of all such algorithms is the construction of an appropriate homotopy map and then tracking some smooth curve in the zero set of this homotopy map. HOMPACK is a mathematical software package implementing glo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014